Unambiguity in Automata Theory
نویسنده
چکیده
Determinism of devices is a key aspect throughout all of computer science, simply because of considerations of efficiency of the implementation. One possible way (among others) to relax this notion is to consider unambiguous machines: non-deterministic machines that have at most one accepting run on each input. In this paper, we will investigate the nature of unambiguity in automata theory, presenting the cases of standard finite words up to infinite trees, as well as data-words and tropical automata. Our goal is to show how this notion of unambiguity is so far not well understood, and how embarrassing open questions remain open.
منابع مشابه
Unambiguity and Fewness for Logarithmic Space 3 (preliminary Version, January 1991)
We consider various types of unambiguity for logarithmic space bounded Turing machines and polynomial time bounded log space auxiliary push-down automata. In particular, we introduce the notions of (general), reach, and strong unambiguity. We demonstrate that closure under complement of unambiguous classes implies equivalence of unambiguity and \unambiguous fewness". This, as we will show, appl...
متن کاملDeciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
This paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus automata. This result is proved through a decidable algebraic characterization involving so-called metatransitions and an application of results from the structure theory of finite semigroups. It is noteworthy that the equivalence problem is known to be undecidable for polynomially ambiguous auto...
متن کاملOn Determinism and Unambiguity of Weighted Two-Way Automata
In this paper, we first study the conversion of weighted two-way automata to one-way automata. We show that this conversion preserves the unambiguity but does not preserve the determinism. Yet, we prove that the conversion of an unambiguous weighted one-way automaton into a two-way automaton leads to a deterministic two-way automaton. As a consequence, we prove that unambiguous weighted two-way...
متن کاملEquivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata
We consider the inclusion and equivalence problem for unambiguous Büchi automata. We show that for a strong version of unambiguity introduced by Carton and Michel these two problems are solvable in polynomial time. We generalize this to Büchi automata with a fixed finite degree of ambiguity in the strong sense. We also discuss the problems that arise when considering the decision problems for t...
متن کاملDeciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
Finite automata with weights in the max-plus semiring are considered. The main result is: it is decidable in an effective way whether a series that is recognized by a finitely ambiguous max-plus automaton is unambiguous, or is sequential. A collection of examples is given to illustrate the hierarchy of max-plus series with respect to ambiguity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015